Characterization of some aggregation functions stable for positive linear transformations
نویسندگان
چکیده
منابع مشابه
Characterization of some aggregation functions stable for positive linear transformations
This paper deals with the characterization of some classes of aggregation functions often used in multicriteria decision making problems. The common properties involved in these characterizations are “increasing monotonicity” and “stability for positive linear transformations”. Additional algebraic properties related to associativity allow to completely specify the functions.
متن کاملSuper- and sub-additive transformations of aggregation functions from the point of view of approximation
The way super- and sub-additive transformations of aggregation functions are introduced involve suprema and infima taken over simplexes whose dimensions may grow arbitrarily. Exact values of such transformations may thus be hard to determine in general. In this note we discuss methods of algorithmic approximation of such transformations.
متن کاملsynthesis and characterization of some macrocyclic schiff bases
ماکروسیکلهای شیف باز از اهمیت زیادی در شیمی آلی و دارویی برخوردار می باشند. این ماکروسیکلها با دارابودن گروه های مناسب در مکانهای مناسب می توانند فلزاتی مثل مس، نیکل و ... را در حفره های خود به دام انداخته، کمپلکسهای پایدار تولید نمایند. در این پایان نامه ابتدا یک دی آلدئید آروماتیک از گلیسیرین تهیه می شود و در مرحله بعدی واکنش با دی آمینهای آروماتیک و یا آلیفاتیک در رقتهای بسیار زیاد منجر به ت...
15 صفحه اولNew characterization of some linear groups
There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...
متن کاملNSE characterization of some linear groups
For a finite group $G$, let $nse(G)={m_kmid kinpi_e(G)}$, where $m_k$ is the number of elements of order $k$ in $G$ and $pi_{e}(G)$ is the set of element orders of $G$. In this paper, we prove that $Gcong L_m(2)$ if and only if $pmid |G|$ and $nse(G)=nse(L_m(2))$, where $min {n,n+1}$ and $2^n-1=p$ is a prime number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Sets and Systems
سال: 1999
ISSN: 0165-0114
DOI: 10.1016/s0165-0114(97)00128-0